Using Greediness for Parameterization: the Case of Max and Min (k, N -k)-cut Using Greediness for Parameterization: the Case of Max and Min (k, N − K)-cut *
نویسندگان
چکیده
max (k, n − k)-cut (resp., min (k, n − k)-cut) is a constrained version of max-cut (resp., min-cut) where one has to find a bipartition of the vertex set into two subsets with respectively k and n − k vertices (n being the total number of vertices of the input graph) which maximizes (resp., minimizes) the number of edges going from one subset to the other. In this paper, we investigate the parameterized complexity of these two graph problems by considering several parameters, such as the value p of the solution, k, the size τ of a minimum vertex cover and the treewidth tw of the input graph. We also give approximation schemata in FPT time for parameterizations which turn out to be W[1]-hard.
منابع مشابه
Using greediness for parameterization: the case of max and min (k, n – k)-cut
max (k, n − k)-cut (resp., min (k, n − k)-cut) is a constrained version of max-cut (resp., min-cut) where one has to find a bipartition of the vertex set into two subsets with respectively k and n − k vertices (n being the total number of vertices of the input graph) which maximizes (resp., minimizes) the number of edges going from one subset to the other. In this paper, we investigate the para...
متن کاملMulti-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization
We study the parameterized complexity of a broad class of problems called " local graph partitioning problems " that includes the classical fixed cardinality problems as max k-vertex cover, k-densest subgraph, etc. By developing a technique " greediness-for-parameterization " , we obtain fixed parameter algorithms with respect to a pair of parameters k, the size of the solution (but not its val...
متن کاملSOME HYPER K-ALGEBRAIC STRUCTURES INDUCED BY MAX-MIN GENERAL FUZZY AUTOMATA
We present some connections between the max-min general fuzzy automaton theory and the hyper structure theory. First, we introduce a hyper BCK-algebra induced by a max-min general fuzzy automaton. Then, we study the properties of this hyper BCK-algebra. Particularly, some theorems and results for hyper BCK-algebra are proved. For example, it is shown that this structure consists of different ty...
متن کاملLogical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem
Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...
متن کاملImprovements of Young inequality using the Kantorovich constant
Some improvements of Young inequality and its reverse for positive numbers with Kantorovich constant $K(t, 2)=frac{(1+t)^2}{4t}$ are given. Using these inequalities some operator inequalities and Hilbert-Schmidt norm versions for matrices are proved. In particular, it is shown that if $a, b$ are positive numbers and $0 leqslant nu leqslant 1,$ then for all integers $ kgeqsl...
متن کامل